Search results for "Polynomial-time approximation scheme"
showing 2 items of 2 documents
Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem Under Unavailability Constraint
2010
Abstract Decision Support Systems (DSS) ensure the computer-based support for the conscientious decision-making in solving problems that require a large amount of information processing and complex scenarios. DSS for Transportation (DSST) are intelligent systems that are used at operational and organizational management levels. Operating a DSST in a public transportation web-based monitoring system is presented in this paper.
ε-Regularized two-level optimization problems: Approximation and existence results
2006
The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.